Complete Problems for Valiant's Class of qp-Computable Families of Polynomials
نویسنده
چکیده
We prove that the families matrix powering, iterated matrix product, and adjoint matrix are VQP{complete, where VQP denotes Valiant's class of quasipolynomial{computable families of multivariate polynomials. This proves a conjecture by B urgisser 3, Conjecture 8.1].
منابع مشابه
Valiant's Model: From Exponential Sums to Exponential Products
We study the power of big products for computing multivariate polynomials in a Valiant-like framework. More precisely, we define a new class VΠP as the set of families of polynomials that are exponential products of easily computable polynomials. We investigate the consequences of the hypothesis that these big products are themselves easily computable. For instance, this hypothesis would imply ...
متن کاملCharacterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the cl...
متن کاملComplexity Classes and Completeness in Algebraic Geometry
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the first family of compact spaces shown to be NP-complete in a geometric setting. Valiant's theory of algebraic/arithmetic complexity classes is an algebraic analo...
متن کاملA spectral method based on the second kind Chebyshev polynomials for solving a class of fractional optimal control problems
In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...
متن کاملNotes in Computer Science 2108
We prove that the families matrix powering, iterated matrix product, and adjoint matrix are VQP–complete, where VQP denotes Valiant’s class of quasipolynomial–computable families of multivariate polynomials. This proves a conjecture by Bürgisser [3, Conjecture 8.1].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001